Efficient Traffic Assignment for Public Transit Networks
نویسندگان
چکیده
We study the problem of computing traffic assignments for public transit networks: Given a public transit network and a demand (i.e. a list of passengers, each with associated origin, destination, and departure time), the objective is to compute the utilization of every vehicle. Efficient assignment algorithms are a core component of many urban traffic planning tools. In this work, we present a novel algorithm for computing public transit assignments. Our approach is based upon a microscopic Monte Carlo simulation of individual passengers. In order to model realistic passenger behavior, we base all routing decisions on travel time, number of transfers, time spent walking or waiting, and delay robustness. We show how several passengers can be processed during a single scan of the network, based on the Connection Scan Algorithm [6], resulting in a highly efficient algorithm. We conclude with an experimental study, showing that our assignments are comparable in terms of quality to the state-of-the-art. Using the parallelized version of our algorithm, we are able to compute a traffic assignment for more than ten million passengers in well below a minute, which outperforms previous works by more than an order of magnitude. 1998 ACM Subject Classification G.2.2 Graph Theory
منابع مشابه
Environmental impact assessment of bus rapid transit (BRT) in the Metropolitan City of Tehran
Bus rapid transit is an innovative, high capacity, lower cost public transit solution in metropolitan cities. Idea is to dedicate lanes for quick and efficient transport of passengers to their destinations. In the present investigation the environmental impact assessment of bus rapid transit in Tehran metropolitan city is brought out. For this purpose bus rapid transit Lane No. 10 is investiga...
متن کاملA Within-day Dynamic Traffic Assignment Logit Model to Multimodal Urban Networks
In this paper, with reference to congested multimodal urban networks, within-day dynamic traffic assignment is formalized as a fixed-point problem in terms of arc flow and transit frequency temporal profiles. The main innovation is to represent transit supply using a frequency approach, instead of a run approach, thus not requiring a diachronic graph. By so doing, intra and inter modal congesti...
متن کاملDifferent Network Performance Measures in a Multi-Objective Traffic Assignment Problem
Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...
متن کاملOverview of the Literature on the Transit-Oriented Development to Investigate a Practical Solution for Traffic Congestion in Iran Cities
Expanding public transportation is not enough to solve the urban sprawl problem resulted from an auto-orientation perspective. So urban planning experts paid attention to integrated and coordinated planning of urban development with public transportation, which reached to sustainable urban development. The purpose of this study is to review the researches in transit-oriented development (TOD) a...
متن کامل